Process Algebra with Nonstandard Timing

نویسنده

  • Kees Middelburg
چکیده

The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with timing presented by Baeten and Middelburg [Handbook of Process Algebra, Elsevier, 2001, Chapter 10]. This possibility is useful in practice when describing and analyzing systems in which actions occur that are entirely independent. However, it is an abstraction of reality to assume that actions can be performed consecutively at the same point in time. In this paper, we propose a process algebra with timing in which this possibility is excluded, but nonstandard non-negative real numbers are included in the time domain. It is shown that this new process algebra generalizes the process algebras with timing from the aforementioned framework in a smooth and natural way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonstandard Braid Relations and Chebyshev Polynomials

A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two Sr-irreducibles into irreducibles. Mulmuley and Sohoni attempt to solve this problem using canonical basis theory, by first constructing a nonstandard Hecke algebra Br, which, though not a Hopf al...

متن کامل

Truly Concurrent Process Algebra with Timing

We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete absolute timing, continuous relative timing and continuous absolute timing.

متن کامل

Representation Theory of the Nonstandard Hecke Algebra

The nonstandard Hecke algebra Ȟr was defined in [11] to study the Kronecker problem. We study a quotient Ȟr,2 of Ȟr , called the nonstandard Temperley-Lieb algebra, which is simpler than Ȟr. It is defined to be the subalgebra of Hr,2⊗Hr,2 generated by Pi := C ′ i ⊗C ′ i +Ci ⊗Ci, i ∈ [r− 1], where Hr,2 is the Temperley-Lieb algebra and C i and Ci are Kazhdan-Lusztig basis elements. We give a com...

متن کامل

Located Actions in Process Algebra with Timing

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile interme...

متن کامل

Discrete Time Process Algebra with Relative Timing

Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2002